package ppd;


/**
 * <p>
 *  第K大的元素
 *  [3,2,3,1,2,4,5,5,6], k = 4
 * </p>
 *
 * @author weiyunbing
 * @since 2025/6/23 19:07
 **/
public class KLargestNum {


    public int findKthLargest(int[] nums, int k) {
        int left = 0, right = nums.length - 1;
        return -1;
    }

    public void sortKthLargest(int[] nums, int left, int right){
        if(left == right){
            return;
        }
        int mid = left + (right - left) / 2;
        while(left < right){
            if(nums[left] < nums[right]){
                left++;
            }
        }
    }

}
